Retrieval of Semantic Workflows with Knowledge Intensive Similarity Measures
Identifieur interne : 000922 ( Main/Exploration ); précédent : 000921; suivant : 000923Retrieval of Semantic Workflows with Knowledge Intensive Similarity Measures
Auteurs : Ralph Bergmann (informaticien) [Allemagne] ; Yolanda Gil [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: We describe a new model for representing semantic workflows as semantically labeled graphs, together with a related model for knowledge intensive similarity measures. The application of this model to scientific and business workflows is discussed. Experimental evaluations show that similarity measures can be modeled that are well aligned with manual similarity assessments. Further, new algorithms for workflow similarity computation based on A* search are described. A new retrieval algorithm is introduced that goes beyond traditional sequential retrieval for graphs, interweaving similarity computation with case selection. Significant reductions on the overall retrieval time are demonstrated without sacrificing the correctness of the computed similarity.
Url:
DOI: 10.1007/978-3-642-23291-6_4
Affiliations:
- Allemagne, États-Unis
- Californie, Rhénanie-Palatinat
- Los Angeles, Trèves (Allemagne)
- Université de Californie du Sud, Université de Trèves
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001870
- to stream Istex, to step Curation: 001754
- to stream Istex, to step Checkpoint: 000135
- to stream Main, to step Merge: 000953
- to stream Main, to step Curation: 000922
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Retrieval of Semantic Workflows with Knowledge Intensive Similarity Measures</title><author><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann (informaticien)</name><affiliation><country>Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Gil, Yolanda" sort="Gil, Yolanda" uniqKey="Gil Y" first="Yolanda" last="Gil">Yolanda Gil</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:9200775BBA73AC11E62737B5F0F50DC459A39041</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-23291-6_4</idno><idno type="url">https://api.istex.fr/document/9200775BBA73AC11E62737B5F0F50DC459A39041/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001870</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001870</idno><idno type="wicri:Area/Istex/Curation">001754</idno><idno type="wicri:Area/Istex/Checkpoint">000135</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000135</idno><idno type="wicri:doubleKey">0302-9743:2011:Bergmann R:retrieval:of:semantic</idno><idno type="wicri:Area/Main/Merge">000953</idno><idno type="wicri:Area/Main/Curation">000922</idno><idno type="wicri:Area/Main/Exploration">000922</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Retrieval of Semantic Workflows with Knowledge Intensive Similarity Measures</title><author><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann (informaticien)</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Business Information Systems II, University of Trier, 54286, Trier</wicri:regionArea><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Gil, Yolanda" sort="Gil, Yolanda" uniqKey="Gil Y" first="Yolanda" last="Gil">Yolanda Gil</name><affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Information Sciences Institute, University of Southern California, 90292, Marina del Rey, CA</wicri:regionArea><placeName><region type="state">Californie</region><settlement type="city">Los Angeles</settlement></placeName><orgName type="university">Université de Californie du Sud</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">9200775BBA73AC11E62737B5F0F50DC459A39041</idno><idno type="DOI">10.1007/978-3-642-23291-6_4</idno><idno type="ChapterID">4</idno><idno type="ChapterID">Chap4</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We describe a new model for representing semantic workflows as semantically labeled graphs, together with a related model for knowledge intensive similarity measures. The application of this model to scientific and business workflows is discussed. Experimental evaluations show that similarity measures can be modeled that are well aligned with manual similarity assessments. Further, new algorithms for workflow similarity computation based on A* search are described. A new retrieval algorithm is introduced that goes beyond traditional sequential retrieval for graphs, interweaving similarity computation with case selection. Significant reductions on the overall retrieval time are demonstrated without sacrificing the correctness of the computed similarity.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>États-Unis</li></country><region><li>Californie</li><li>Rhénanie-Palatinat</li></region><settlement><li>Los Angeles</li><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Californie du Sud</li><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann (informaticien)</name></region><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann (informaticien)</name></country><country name="États-Unis"><region name="Californie"><name sortKey="Gil, Yolanda" sort="Gil, Yolanda" uniqKey="Gil Y" first="Yolanda" last="Gil">Yolanda Gil</name></region><name sortKey="Gil, Yolanda" sort="Gil, Yolanda" uniqKey="Gil Y" first="Yolanda" last="Gil">Yolanda Gil</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000922 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000922 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:9200775BBA73AC11E62737B5F0F50DC459A39041
|texte= Retrieval of Semantic Workflows with Knowledge Intensive Similarity Measures
}}
| This area was generated with Dilib version V0.6.31. |  |